discrete Fourier transform - definitie. Wat is discrete Fourier transform
Diclib.com
Woordenboek ChatGPT
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

Wat (wie) is discrete Fourier transform - definitie


Discrete Fourier transform         
  • Discrete transforms embedded in time & space.
  • FFT]] algorithm computes one cycle of the DFT and its inverse is one cycle of the DFT inverse.
TECHNIQUE USED IN ADVANCED MATHEMATICS
Discrete fourier transform; Generalized discrete Fourier transform; Discrete Fourier Transform; Shifted DFT; Centered DFT; Offset DFT; DTFS; Inverse discrete Fourier transform; Circular convolution theorem; Cross-correlation theorem; Circular cross-correlation
In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence.
discrete Fourier transform         
  • Discrete transforms embedded in time & space.
  • FFT]] algorithm computes one cycle of the DFT and its inverse is one cycle of the DFT inverse.
TECHNIQUE USED IN ADVANCED MATHEMATICS
Discrete fourier transform; Generalized discrete Fourier transform; Discrete Fourier Transform; Shifted DFT; Centered DFT; Offset DFT; DTFS; Inverse discrete Fourier transform; Circular convolution theorem; Cross-correlation theorem; Circular cross-correlation
<mathematics> (DFT) A Fourier transform, specialized to the case where the abscissas are integers. The DFT is central to many kinds of signal processing, including the analysis and compression of video and sound information. A common implementation of the DFT is the {Fast Fourier Transform} (FFT). See also discrete cosine transform. (1997-03-10)
Discrete Fourier transform (general)         
GENERALIZATION OF FOURIER TRANSFORM TO ANY RING
Number-theoretic transform; Number theoretic transform; Discrete weighted transform; Discrete Fourier transform (general)
In mathematics, the discrete Fourier transform over an arbitrary ring generalizes the discrete Fourier transform of a function whose values are complex numbers.